Real-Time Optimal Mission Scheduling and Flight Path Selection

An Optimal Multiprocessor Real-Time Scheduling Algorithm

An optimal scheduling algorithm is described that feasibly schedules a set of m periodic tasks on n processors before their respective deadlines, if the task set satisses certain conditions. The complexity of this scheduling algorithm in terms of the number of scheduled tasks and the number of processors and upper bounds on the number of preemptions in a given time interval and for any single t...

Optimal Scheduling of CHP-based Microgrid Under Real-Time Demand Response Program

Microgrid (MG) is considered as a feasible solution to integrate the distributed energy sources. In this paper, optimal scheduling of a grid-connected MG is investigated considering different power sources as combined heat and power (CHP) units, only power and heat generating units, and battery storage systems. Two different feasible operating regions are considered for the CHP units. In additi...

Real-Time Path Planning for Time-Optimal Exploration

Motivated by cooperative exploration missions, this paper considers constant velocity, level flight path planning for Unmanned Air Vehicles (UAVs) equipped with range limited, omni-directional sensors. These active energy-based sensors collect information about objects of interest at rates that depend on the range to the objects according to Shannon’s channel capacity equation, where the signal...

Flight Path of Least Time

Optimal Scheduling for Fault-Tolerant and Firm Real-Time Systems

Time redundancy is an effective method for achieving fault tolerance in a real-time system, when space redundancy cannot be used for cost or weight constraints. This paper presents a fault-tolerant scheduling algorithm for real-time systems consisting of firm and hard periodic tasks. Firm tasks can occasionally skip one instance according to a predefined quality-ofservice parameter, whereas har...